Generation of random processes for fatigue testing
نویسندگان
چکیده
منابع مشابه
Random Pattern Generation Processes *
This paper deals with a new class of image models called mosaic models that view an image as a random pattern and model it by an appropriate planar process. There are several different kinds of image models in use. Mandelbrot, [l] models irregular and fragmentary natural patterns by Brownian surfaces (Fig. 1). Wong [2], H assner [3], and others model images by two-dimensional random fields. Mat...
متن کاملModelling of Random Vehicle Fatigue Loads through Transformed Gaussian Processes
In this report we will present a simple way to model and simulate random fatigue loads, which are oftenly both non-stationary and non-Gaussian. The method is based on approximating the non-Gaussian process by a transformation of a Gaussian process. The procedure can be used to simulate loads as well as calculating important cycle properties of the load such as the rainnow cycle and wavelength-a...
متن کاملGeneration and Testing of Random Numbers for Cryptographic Applications
Random number sequences are of crucial importance in almost every aspect of modern digital cryptography, having a significant impact on the strength of cryptographic primitives in securing secret information by rendering it unknown, unguessable, unpredictable and irreproducible for an adversary. Although the major importance of high performance and high quality randomness generators in cryptogr...
متن کاملOn the Role of Entropy Generation in Processes Involving Fatigue
In this paper we describe the potential of employing the concept of thermodynamic entropy generation to assess degradation in processes involving metal fatigue. It is shown that empirical fatigue models such as Miner’s rule, Coffin-Manson equation, and Paris law can be deduced from thermodynamic consideration.
متن کاملUniform Random Generation and Dominance Testing for CP-Nets
The generation of preferences represented as CP-nets for experiments and empirical testing has typically been done in an ad hoc manner that may have introduced a large statistical bias in previous experimental work. We present novel polynomial-time algorithms for generating CP-nets with n nodes and maximum in-degree c uniformly at random. We extend this result to several statistical cultures co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 1985
ISSN: 0304-4149
DOI: 10.1016/0304-4149(85)90022-5